Labelled Tableaux for Multi-Modal Logics
نویسنده
چکیده
In this paper we present a tableau-like proof system for multi-modal logics based on D’Agostino and Mondadori’s classical refutation system KE [DM94]. The proposed system, that we call KEM , works for the logics S5A and S5P(n) which have been devised by Mayer and van der Hoek [MvH92] for formalizing the notions of actuality and preference. We shall also show howKEM works with the normal modal logics K45, D45, and S5 which are frequently used as bases for epistemic operators – knowledge, belief (see, for example [Hoe93, Wan90]), and we shall briefly sketch how to combine knowledge and belief in a multi-agent setting through KEM modularity.
منابع مشابه
A Tableau Compiled Labelled Deductive System for Hybrid Logic
Compiled Labelled Deductive Systems (CLDS) provide a uniform logical framework where families of different logics can be given a uniform proof system and semantics. A variety of applications of this framework have been proposed so far ranging from extensions of classical logics (e.g. normal modal logics and multi-modal logics) to non-classical logics such as resource and substructural loogics. ...
متن کاملModal tableaux for verifying security protocols
To develop theories to specify and reason about various aspects of multi-agent systems, many researchers have proposed the use of modal logics such as belief logics, logics of knowledge, and logics of norms. As multi-agent systems operate in dynamic environments, there is also a need to model the evolution of multi-agent systems through time. In order to introduce a temporal dimension to a beli...
متن کاملLabelled modal tableaux
Labelled tableaux are extensions of semantic tableaux with annotations (labels, indices) whose main function is to enrich the modal object language with semantic elements. This paper consists of three parts. In the first part we consider some options for labels: simple constant labels vs labels with free variables, logic depended inference rules vs labels manipulation based on a label algebra. ...
متن کاملFree Variable Tableaux for Propositional Modal Logics Universit at Karlsruhe Fakult at F Ur Informatik Free Variable Tableaux for Propositional Modal Logics
We present a sound, complete, modular and lean labelled tableau calculus for many propositional modal logics where the labels contain \free" and \universal" variables. Our \lean" Prolog implementation is not only surprisingly short, but compares favourably with other considerably more complex implementations for modal deduction.
متن کاملLabelled Tableaux for Non-normal Modal Logics
In this paper we show how to extend KEM, a tableau-like proof system for normal modal logic, in order to deal with classes of non-normal modal logics, such as monotonic and regular, in a uniform and modular way.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995